Quantum vs Classical Ranking in Segment Grouping

نویسندگان

  • Francisco Escolano
  • Boyan Bonev
  • Edwin R. Hancock
چکیده

In this paper we explore the use of ranking as a mean of guiding unsupervised image segmentation. Starting by the well known Pagerank algorithm we introduce an extension based on quantum walks. Pagerank (rank) can be used to prioritize the merging of segments embedded in uniform regions (parts of the image with roughly similar appearance statistics). Quantum Pagerank, on the other hand, gives high priority to boundary segments. This latter effect is due to the higher order interactions captured by quantum fluctuations. However we found that qrank does not always outperform its classical version. We analyze the Pascal VOC database and give Intersection over Union (IoU) performances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

When the classical & quantum mechanical considerations hint to a single point; a microscopic particle in a one dimensional box with two infinite walls and a linear potential inside it

In this paper we have solved analytically the Schrödinger equation for a microscopic particle in a one-dimensional box with two infinite walls, which the potential function inside it, has a linear form. Based on the solutions of this special quantum mechanical system, we have shown that as the quantum number approaches infinity the expectation values of microscopic particle position and square ...

متن کامل

Improving Ranking Using Quantum Probability

Data management systems, like database, information extraction, information retrieval or learning systems, store, organize, index, retrieve and rank information units, such as tuples, objects, documents, items to match a pattern (e.g. classes and profiles) or meet a requirement (e.g., relevance, usefulness and utility). To this end, these systems rank information units by probability to decide ...

متن کامل

اثر برهم‌کنش‌های چهار اسپینی برروی سیمای فاز مدل هایزنبرگ J1-J2 پادفرومغناطیس اسپین 3/2 شبکه لانه زنبوری

In this study, the effect of four-spin exchanges between the nearest and next nearest neighbor spins of honeycomb lattice on the phase diagram of S=3/2 antiferomagnetic Heisenberg model is considered with two-spin exchanges between the nearest and next nearest neighbor spins. Firstly, the method is investigated with classical phase diagram. In classical phase diagram, in addition to Neel order,...

متن کامل

مروری بر شبکه­ های عصبی کوانتومی

In this paper the development of quantum neural networks (QNN), and some of presented models and physical implementation are reviewed. How of making use of double-slit experiment for implementing QNN and methods of designing as well as examples of two-layer hybrid networks in QNN constructed from quantum neurons and classical neurons are represented. Some application models of the networks (QNN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014